翻訳と辞書 Words near each other ・ Self-Master Colony ・ Self-medication ・ Self-medication (disambiguation) ・ Self-microemulsifying drug delivery system ・ Self-mixing interferometry ・ Self-modifying code ・ Self-monitoring ・ Self-motion ・ Self-neglect ・ Self-optimization ・ Self-organising heuristic ・ Self-organization ・ Self-organized criticality ・ Self-organized criticality control ・ Self-Organized Time Division Multiple Access ・ Self-organizing list ・ Self-organizing map ・ Self-organizing network ・ Self-oscillation ・ Self-ownership ・ Self-paced instruction ・ Self-parenting ・ Self-parody ・ Self-perceived quality-of-life scale ・ Self-perception theory ・ Self-persuasion ・ Self-phase modulation ・ Self-pity ・ Self-policing ・ Self-pollination Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Self-organizing list ： ウィキペディア英語版 Self-organizing list A self-organizing list is a list that reorders its elements based on some self-organizing heuristic to improve average access time. The aim of a self-organizing list is to improve efficiency of linear search by moving more frequently accessed items towards the head of the list. A self-organizing list achieves near constant time for element access in the best case. A self-organizing list uses a reorganizing algorithm to adapt to various query distributions at runtime. ==History== The concept of self-organizing lists has its roots in the idea of activity organization of records in files stored on disks or tapes. One frequently cited discussion of self-organizing files and lists is Knuth . John McCabe has the first algorithmic complexity analyses of the Move-to-Front (MTF) strategy where an item is moved to the front of the list after it is accessed. . He analyses the average time needed for randomly ordered list to get in optimal order. The optimal ordering of a list is the one in which items are ordered in the list by the probability with which they will be needed, with the most accessed item first. The optimal ordering may not be known in advance, and may also change over time. McCabe introduced the transposition strategy in which an accessed item is exchanged with the item in front of it in the list. He made the conjecture that transposition worked at least as well in the average case as MTF in approaching the optimal ordering of records in the limit. This conjecture was later proved by Rivest. McCabe also noted that with either the transposition or MTF heuristic, the optimal ordering of records would be approached even if the heuristic was only applied every Nth access, and that a value of N might be chosen that would reflect the relative cost of relocating records with the value of approaching the optimal ordering more quickly. Further improvements were made, and algorithms suggested by researchers including: Rivest, Tenenbaum and Nemes, Knuth, and Bentley and McGeoch (e.g. Worst-case analyses for self-organizing sequential search heuristics). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Self-organizing list」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.